A Stochastic knapsack problem with mixed distributional capacity
نویسندگان
چکیده
منابع مشابه
On a Stochastic Knapsack Problem
The deterministic knapsack problem is a well known and well studied NP-hard combinatorial optimization problem. It consists in filling a knapsack with items out of a given set such that the weight capacity of the knapsack is respected and the total reward maximized. For a review of references on the stochastic knapsack problem, stochastic gradient algorithms and branch-and-bound methods see [4]...
متن کاملThe Adaptive Knapsack Problem with Stochastic Rewards
Given a set of items with associated deterministic weights and random rewards, the Adaptive Stochastic Knapsack Problem (Adaptive SKP) maximizes the probability of reaching a predetermined target reward level when items are inserted sequentially into a capacitated knapsack before the reward of each item is realized. This model arises in resource allocation problems which permit or require seque...
متن کاملResource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic
In this paper we propose an approach for solving problems of optimal resource capacity allocation to a collection of stochastic dynamic competitors. In particular, we introduce the knapsack problem for perishable items, which concerns the optimal dynamic allocation of a limited knapsack to a collection of perishable or non-perishable items. We formulate the problem in the framework of Markov de...
متن کاملDistributionally Robust Stochastic Knapsack Problem
This paper considers a distributionally robust version of a quadratic knapsack problem. In this model, a subsets of items is selected to maximizes the total profit while requiring that a set of knapsack constraints be satisfied with high probability. In contrast to the stochastic programming version of this problem, we assume that only part of information on random data is known, i.e., the firs...
متن کاملOn a Stochastic Bilevel Programming Problem with Knapsack Constraints
In this paper we propose a mixed integer bilevel problem having a probabilistic knapsack constraint in the first level. The problem formulation is mainly motivated by practical pricing and service provision problems as it can be interpreted as a model for the interaction between a service provider and clients. We assume the probability space to be discrete which allows us to reformulate the pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Journal of Scientific and Industrial Research
سال: 2011
ISSN: 2153-649X
DOI: 10.5251/ajsir.2011.2.1.24.32